62 resultados para GLOBAL REASSESSMENT

em Chinese Academy of Sciences Institutional Repositories Grid Portal


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Using spatially averaged global model, we succeed in obtaining some plasma parameters for a low pressure inductively coupled plasma source of our laboratory. As far as the global balance is concerned, the models can give reasonable results of the parameters, such as the global electron temperature and the ion impacting energy, etc. It is found that the ion flow is hardly affected by the neutral gas pressure. Finally, the magnetic effects are calculated by means of the method. The magnetic field can play an important role to increase plasma density and ion current.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Abstract This paper presents a hybrid heuristic{triangle evolution (TE) for global optimization. It is a real coded evolutionary algorithm. As in di®erential evolution (DE), TE targets each individual in current population and attempts to replace it by a new better individual. However, the way of generating new individuals is di®erent. TE generates new individuals in a Nelder- Mead way, while the simplices used in TE is 1 or 2 dimensional. The proposed algorithm is very easy to use and e±cient for global optimization problems with continuous variables. Moreover, it requires only one (explicit) control parameter. Numerical results show that the new algorithm is comparable with DE for low dimensional problems but it outperforms DE for high dimensional problems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose an integrated algorithm named low dimensional simplex evolution extension (LDSEE) for expensive global optimization in which only a very limited number of function evaluations is allowed. The new algorithm accelerates an existing global optimization, low dimensional simplex evolution (LDSE), by using radial basis function (RBF) interpolation and tabu search. Different from other expensive global optimization methods, LDSEE integrates the RBF interpolation and tabu search with the LDSE algorithm rather than just calling existing global optimization algorithms as subroutines. As a result, it can keep a good balance between the model approximation and the global search. Meanwhile it is self-contained. It does not rely on other GO algorithms and is very easy to use. Numerical results show that it is a competitive alternative for expensive global optimization.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, a new method for designing three-zone optical pupil filter is presented. The phase-only optical pupil filter and the amplitude-only optical pupil filters were designed. The first kind of pupil for optical data storage can increase the transverse resolution. The second kind of pupil filter can increase the axial and transverse resolution at the same time, which is applicable in three-dimension imaging in confocal microscopy. (C) 2007 Elsevier GmbH. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

When noises considerations are made, nonredundant arrays (NRAs) are endowed with many advantages which other arrays e.g., uniformly redundant arrays (URAs) do not possess in applications of coded aperture imaging. However, lower aperture opening ratio limits the applications of NRA in practice. In this paper, we present a computer searching method based on a global optimization algorithm named DIRECT to design NRAs. Compared with the existing NRAs e.g., Golay's NRAs, which are well known and widely used in various applications, NRAs found by our method have higher aperture opening ratio and auto correlation compression ratio. These advantages make our aperture arrays be very useful for practical applications especially for which of aperture size are limited. Here, we also present some aperture arrays we found. These aperture arrays have an interesting property that they belong to both NRA and URA. (C) 2006 Elsevier GmbH. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Our study of a novel technique for adaptive image sequence coding is reported. The number of reference frames and the intervals between them are adjusted to improve the temporal compensability of the input video. The bits are distributed more efficiently on different frame types according to temporal and spatial complexity of the image scene. Experimental results show that this dynamic group-of-picture (GOP) structure coding scheme is not only feasible but also better than the conventional fixed GOP method in terms of perceptual quality and SNR. (C) 1996 Society of Photo-Optical Instrumentation Engineers.